Learning and Predicting Dynamic Network Behavior with Graphical Multiagent Models

نویسندگان

  • Quang Duong
  • Michael P. Wellman
  • Satinder Singh
  • Michael Kearns
چکیده

Factored models of multiagent systems address the complexity of joint behavior by exploiting locality in agent interactions. History-dependent graphical multiagent models (hGMMs) further capture dynamics by conditioning behavior on history. The hGMM framework also brings new elements of strategic reasoning and more expressive powers to modeling information diffusion over networks. We propose a greedy algorithm for learning hGMMs from time-series data, inducing both graphical structure and parameters. To evaluate this learning method, we employ human-subject experiment data for a voting consensus scenario, where agents on a network attempt to reach a unanimous vote. We empirically show that the learned hGMMs directly expressing joint behavior outperform alternatives in predicting dynamic voting behavior.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning and Predicting Dynamic Behavior with Graphical Multiagent Models

Factored models of multiagent systems address the complexity of joint behavior by exploiting locality in agent interactions. History-dependent graphical multiagent models (hGMMs) further capture dynamics by conditioning behavior on history. We propose a greedy algorithm for learning hGMMs from time-series data, inducing both graphical structure and parameters. To evaluate this learning method, ...

متن کامل

Learning and predicting dynamic networked behavior with graphical multiagent models

Factored models of multiagent systems address the complexity of joint behavior by exploiting locality in agent interactions. History-dependent graphical multiagent models (hGMMs) further capture dynamics by conditioning behavior on history. The challenges of modeling real human behavior motivated us to extend the hGMM representation by distinguishing two types of agent interactions. This distin...

متن کامل

Graphical Multiagent Models ( Extended

I introduce a graphical representation for modeling multiagent systems based on different kinds of reasoning about agent behavior. I seek to investigate this graphical model’s predictive and representative capabilities across various domains, and examine methods for learning the graphical structure from agent interaction data. I also propose to explore the framework’s scalability in large real-...

متن کامل

A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem

Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...

متن کامل

History-dependent graphical multiagent models

A dynamic model of a multiagent system defines a probability distribution over possible system behaviors over time. Alternative representations for such models present tradeoffs in expressive power, and accuracy and cost for inferential tasks of interest. In a history-dependent representation, behavior at a given time is specified as a probabilistic function of some portion of system history. M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011